Generating Shorter Bases for Hard Random Lattices
نویسندگان
چکیده
منابع مشابه
Generating random elements of finite distributive lattices
This survey article describes a method for choosing uniformly at random from any finite set whose objects can be viewed as constituting a distributive lattice. The method is based on ideas of the author and David Wilson for using “coupling from the past” to remove initialization bias from Monte Carlo randomization. The article describes several applications to specific kinds of combinatorial ob...
متن کاملOn Nearly Orthogonal Lattice Bases and Random Lattices
We study lattice bases where the angle between any basis vector and the linear subspace spanned by the other basis vectors is at least π 3 radians; we denote such bases as “nearly orthogonal.” We show that a nearly orthogonal lattice basis always contains a shortest lattice vector. Moreover, we prove that if the basis vector lengths are “nearly equal,” then the basis is the unique nearly orthog...
متن کاملGenerating Hard Random Boolean Formulas and Disjunctive Logic Programs
We propose a model of random quantified boolean formulas and their natural random disjunctive logic program counterparts. The model extends the standard models for random SAT and 2QBF. We provide theoretical bounds for the phase transition region in the new model, and show experimentally the presence of the easy-hard-easy pattern. Importantly, we show that the model is well suited for assessing...
متن کاملWilson Bases for General Time-Frequency Lattices
Motivated by a recent generalization of the Balian-Low theorem and by new research in wireless communications we analyze the construction of Wilson bases for general time-frequency lattices. We show that orthonormal Wilson bases for L(R) can be constructed for any time-frequency lattice whose volume is 1 2 . We then focus on the spaces l(Z) and C which are the preferred settings for numerical a...
متن کاملOn Bases of Circuit Lattices
Our aim is to propose and study the following conjecture. There exists a set of cycles of each binary matroid B, which form a basis of the integer lattice generated by the circuits of B.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory of Computing Systems
سال: 2010
ISSN: 1432-4350,1433-0490
DOI: 10.1007/s00224-010-9278-3